A Heuristic Search Algorithm with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
نویسندگان
چکیده
The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. One of the well-known heuristic search methods for MLD is the A decoding algorithm proposed by Han et al. Based on the decoding algorithms both by Battail and Fang (and its improved technique by Valembois and Fossorier) and by the present authors, we deduce a new method for reducing the space complexity of the A decoding algorithm. Simulation results show the high efficiency of the proposed method. Keywords— maximum likelihood decoding, binary block codes, heuristic search, most reliable basis, reliability
منابع مشابه
A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. Based on the decoding algorithms both of Battail and Fang and of its generalized version sugg...
متن کاملFast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding
We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. I...
متن کاملMultiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization
A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل